FE and iO for Turing Machines from Minimal Assumptions.
Shweta Agrawal, Monosij Maitra
Appeared in
Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11-14, 2018, Proceedings, Part II (TCC 2018),
Lecture Notes in Computer Science, Vol 11240, pp.473-512, Nov 2018.
Wiretap Polar Codes in Encryption Schemes Based on Learning with Errors Problem.
Aswin Rajagopalan, Andrew Thangaraj, Shweta Agrawal
Appeared in
2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, June 17-22, 2018 (ISIT 2018),
pp.1146-1150, Jun 2018.
FE and iO for Turing Machines from Minimal Assumptions.
New Methods for Indistinguishability Obfuscation: Bootstrapping and Instantiation.
Shweta Agrawal
Appeared in
IACR Cryptol. ePrint Arch.,
Vol 2018, pp.633, 2018.
Functional Encryption for Bounded Collusions, Revisited.
Shweta Agrawal, Alon Rosen
Appeared in
Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I (TCC 2017),
Lecture Notes in Computer Science, Vol 10677, pp.173-205, Nov 2017.
Efficient Public Trace and Revoke from Standard Assumptions: Extended Abstract.
Stronger Security for Reusable Garbled Circuits, General Definitions and Attacks.
Shweta Agrawal
Appeared in
Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part I,
Lecture Notes in Computer Science, Vol 10401, pp.3-35, Aug 2017.
Reusable Garbled Deterministic Finite Automata from Learning With Errors.
Shweta Agrawal, Ishaan Preet Singh
Appeared in
44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland (ICALP 2017),
LIPIcs, Vol 80, pp.36:1-36:13, Jul 2017.
Efficient Public Trace and Revoke from Standard Assumptions.